A note on a conjecture on maximum matching in almost regular graphs
نویسندگان
چکیده
منابع مشابه
On maximum matchings in almost regular graphs
In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph G with 2 ≤ δ(G) ≤ ∆(G) ≤ 3 contains a maximum matching whose unsaturated vertices do not have a common neighbor, where ∆(G) and δ(G) denote the maximum and minimum degrees of vertices in G, respectively. In the same paper they suggested the following conjecture: every graph G with ∆(G)− δ(G) ≤ 1 contains a maximum matching whos...
متن کاملA note on vague graphs
In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.
متن کاملOn almost distance-regular graphs
Distance-regular graphs have been a key concept in Algebraic Combinatorics and have given place to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study ‘almost distance-regular graphs’. We use this name informally for graphs that share some regularity properties that are related to distance in the ...
متن کاملMaximum Induced Matching on Regular Graphs and Trees
We investigate the complexity of the Maximum Induced Matching problem on regular graphs and trees. The problem is shown to be NP-complete on regular graphs of degree 4s for any positive integer s. We also looks at very simple approximation algorithms: we show that the largest induced matching in a regular graph of degree d can be approximated with a performance ratio less than d. However a simp...
متن کاملA Note on Randomly Regular Graphs
The graph G is said to be a randomly H graph if and only if any subgraph of G without isolated vertices, which is isomorphic to a subgraph of H, can be extended to a subgraph F of G such that F is isomorphic to H. In this paper the problem about randomly H graphs is discussed, where H is a connected regular graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.09.003